منابع مشابه
Knots with g(E(K)) = 2 and . . .
We show that there exist knots K ⊂ S with g(E(K)) = 2 and g(E(K#K#K)) = 6. Together with [5, Theorem 1.5], this proves existence of counterexamples to Morimoto’s Conjecture [10]. This is a special case of [6]. Let Ki (i = 1, 2) be knots in the 3-sphere S, and let K1#K2 be their connected sum. We use the notation t(·), E(·), and g(·) to denote tunnel number, exterior, and Heegaard genus respecti...
متن کاملKnots with g(E(K)) = 2 and g(E(K#K#K)) = 6 and Morimoto’s Conjecture
We show that there exist knots K ⊂ S with g(E(K)) = 2 and g(E(K#K#K)) = 6. Together with [5, Theorem 1.5], this proves existence of counterexamples to Morimoto’s Conjecture [10]. This is a special case of [6]. Let Ki (i = 1, 2) be knots in the 3-sphere S, and let K1#K2 be their connected sum. We use the notation t(·), E(·), and g(·) to denote tunnel number, exterior, and Heegaard genus respecti...
متن کاملK.Khadiev WIDTH HIERARCHY FOR K-OBDD OF SMALL WIDTH
In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...
متن کاملWidth Hierarchy for k-OBDD of Small Width
In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...
متن کاملDetermining Maximum k-Width-Connectivity on Meshes
Let I be a n n binary image stored in a n n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometriae Dedicata
سال: 2009
ISSN: 0046-5755,1572-9168
DOI: 10.1007/s10711-009-9368-z